Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
نویسندگان
چکیده
منابع مشابه
Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid
In this paper, we investigate the common unfolding between regular tetrahedra and Johnson-Zalgaller solids. More precisely, we investigate the sets of all edge developments of Johnson-Zalgaller solids that fold into regular tetrahedra. We show that, among 92 Johnson-Zalgaller solids, only J17 (gyroelongated square dipyramid) and J84 (snub disphenoid) have some edge developments that fold into a...
متن کاملConvex developments of a regular tetrahedron
The best-known developments of a regular tetrahedron are an equilateral triangle and a parallelogram. Are there any other convex developments of a regular tetrahedron? In this paper we will show that there are convex developments of a regular tetrahedron having the following shapes: an equilateral triangle, an isosceles triangle, a right-angled triangle, scalene triangles, rectangles, parallelo...
متن کاملContinuous Flattening of a Regular Tetrahedron with Explicit Mappings
We use the terminology polyhedron for a closed polyhedral surface which is permitted to touch itself but not self-intersect (and so a doubly covered polygon is a polyhedron). A flat folding of a polyhedron is a folding by creases into a multilayered planar shape ([7], [8]). A. Cauchy [4] in 1813 proved that any convex polyhedron is rigid: precisely, if two convex polyhedra P, P ′ are combinator...
متن کاملDistance-regular graphs and the q-tetrahedron algebra
Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and b 6= 1, α = b − 1. The condition on α implies that Γ is formally self-dual. For b = q we use the adjacency matrix and dual adjacency matrix to obtain an action of the q-tetrahedron algebra ⊠q on the standard module of Γ. We describe four algebra homomorphisms into ⊠q from the quantum affine algebra Uq(ŝl2); using t...
متن کاملFast Tetrahedron-Tetrahedron Overlap Algorithm
We present an algorithm to test two tetrahedra for overlap. The algorithm is based on a dimension reduction technique that allows to apply the Separating Axis Theorem avoiding part of the computation needed to perform the Separating Axis Test. Source code is available online.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2016
ISSN: 1526-1719
DOI: 10.7155/jgaa.00386